#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=550;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
multiset<LL>s1;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      s1.clear();
      LL n,l,r,s;cin>>n>>l>>r>>s;
      for(LL i=1;i<=n;i++) s1.insert(i);
      LL len=r-l+1;
      for(LL i=0;i<=n+10;i++) a[i]=0;
      if((1+len)*len/2>s){
         cout<<"-1"<<"\n";
         continue;
      }
      if((n+(n-len+1))*len/2<s){
         cout<<"-1"<<"\n";
         continue;
      }
      LL cnt=s-(1+len)*len/2;
     // debug(cnt);
      LL num=0;
      for(LL i=l;i<=r;i++) a[i]=++num;
      multiset<LL>:: iterator it;
      for(LL i=r;i>=l;i--){
          if(cnt<=0){
            break;
          }
          cnt+=a[i];
          it=s1.lower_bound(cnt);
          a[i]=*it;
          cnt-=a[i];
          s1.erase(a[i]);
          ///s1.insert(a[i]);
      }
      for(LL i=l;i<=r;i++){
          if(s1.count(a[i])){
            s1.erase(a[i]);
          }
      }
      for(LL i=1;i<l;i++){
          cout<<(*s1.begin())<<" ";
          s1.erase(*s1.begin());
      }
      for(LL i=l;i<=r;i++){
          cout<<a[i]<<" ";
      }
      for(LL i=r+1;i<=n;i++){
          cout<<(*s1.begin())<<" ";
          s1.erase(*s1.begin());
      }
      cout<<"\n";
   }
   return 0;
}
